Topological Queries in Spatial Databases
نویسندگان
چکیده
منابع مشابه
Topological Queries in Spatial Databases
We study topological queries over two-dimensional spatial databases. First, we show that the topological properties of semialgebraic spatial regions can be completely specified using a classical finite structure, essentially the embedded planar graph of the region boundaries. This provides an invariant characterizing semi-algebraic regions up to homeomorphism. All topological queries on semialg...
متن کاملGeometric and Algorithmic Aspects of Topological Queries to Spatial Databases
Proefschrift voorgelegd tot het behalen van de graad van doctor in de wetenschappen, richting informatica aan de transnationale Universiteit Limburg te verdedigen door Preface First of all, I would like to thank Jan Van den Bussche for his support during the last four years. His never ending enthusiasm and advice made this dissertation possible. His intensive use of red ballpoints, learned me, ...
متن کاملInfinitary Queries in Spatial Databases
We describe the use of infinitary logics computable over the real numbers (i.e. in the sense of Blum–Shub–Smale, with full-precision arithmetic) as a constraint query language for spatial databases. We give a characterization of the sets definable in various syntactic classes corresponding to the classical hyperarithmetical hierarchy.
متن کاملTopological Relations in Spatial Databases
Various models for the representation of topological relations have been developed. The aim of this chapter is to propose a comprehensive view of state-of-the-art models for topological relations in spatial databases. A prominent role is assumed by the CBM (calculus-based method), which offers a small set of topological relations with high expressiveness and suitability to be embedded as operat...
متن کاملMedoid Queries in Large Spatial Databases
Assume that a franchise plans to open k branches in a city, so that the average distance from each residential block to the closest branch is minimized. This is an instance of the k-medoids problem, where residential blocks constitute the input dataset and the k branch locations correspond to the medoids. Since the problem is NP-hard, research has focused on approximate solutions. Despite an av...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1999
ISSN: 0022-0000
DOI: 10.1006/jcss.1998.1597